Partial Fields and Matroid Representation
نویسنده
چکیده
A partial field P is an algebraic structure that behaves very much like a field except that addition is a partial binary operation, that is, for some a, b ∈ P, a + b may not be defined. We develop a theory of matroid representation over partial fields. It is shown that many important classes of matroids arise as the class of matroids representable over a partial field. The matroids representable over a partial field are closed under standard matroid operations such as the taking of minors, duals, direct sums and 2–sums. Homomorphisms of partial fields are defined. It is shown that if φ : P1 → P2 is a non-trivial partial field homomorphism, then every matroid representable over P1 is representable over P2. The connection with Dowling group geometries is examined. It is shown that if G is a finite abelian group, and r > 2, then there exists a partial field over which the rank–r Dowling group geometry is representable if and only if G has at most one element of order 2, that is, if G is a group in which the identity has at most two square roots.
منابع مشابه
Confinement of matroid representations to subsets of partial fields
Let M be a matroid representable over a (partial) field P and B a matrix representable over a sub-partial field P′ ⊆ P. We say that B confines M to P′ if, whenever a P-representation matrix A of M has a submatrix B, A is a scaled P′-matrix. We show that, under some conditions on the partial fields, on M , and on B, verifying whether B confines M to P′ amounts to a finite check. A corollary of t...
متن کاملSkew Partial Fields, Multilinear Representations of Matroids, and a Matrix Tree Theorem
ABSTRACT. We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte’s definition, using chain groups. We show how such representations behave under duality and minors, we extend Tutte’s representability criterion to this new class, and we study the generator matrices of the chain groups. An ...
متن کاملStructural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملOn the Representability of the Biuniform Matroid
Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given bi-uniform matroid is an open problem too. The interest of these problems is due to their implications to secret sharing. Efficient methods to find representation...
متن کاملMatroidal structure of skew polynomial rings with application to network coding
Over a finite field Fqm , the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate the concept of polynomial independence defined for skew polynomials to the familiar concept of linear independence for vector spaces. This relation allows for the definition of a representable matroid called the Fqm[x;σ]-matroid, wi...
متن کامل